The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(O(1), O(n^1)).

0 CpxTRS
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID), 0 ms)
↳2 CdtProblem
↳3 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)
↳4 CdtProblem
↳5 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))), 114 ms)
↳6 CdtProblem
↳7 SIsEmptyProof (⇔, 0 ms)
↳8 BOUNDS(O(1), O(1))

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
p(s(0)) → 0
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X

Rewrite Strategy: INNERMOST

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
f(z0) → n__f(z0)
p(s(0)) → 0
activate(n__f(z0)) → f(z0)
activate(z0) → z0
Tuples:

F(s(0)) → c1(F(p(s(0))), P(s(0)))
ACTIVATE(n__f(z0)) → c4(F(z0))
S tuples:

F(s(0)) → c1(F(p(s(0))), P(s(0)))
ACTIVATE(n__f(z0)) → c4(F(z0))
K tuples:none
Defined Rule Symbols:

f, p, activate

Defined Pair Symbols:

F, ACTIVATE

Compound Symbols:

c1, c4

(3) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 1 leading nodes:

ACTIVATE(n__f(z0)) → c4(F(z0))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
f(z0) → n__f(z0)
p(s(0)) → 0
activate(n__f(z0)) → f(z0)
activate(z0) → z0
Tuples:

F(s(0)) → c1(F(p(s(0))), P(s(0)))
S tuples:

F(s(0)) → c1(F(p(s(0))), P(s(0)))
K tuples:none
Defined Rule Symbols:

f, p, activate

Defined Pair Symbols:

F

Compound Symbols:

c1

(5) CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

F(s(0)) → c1(F(p(s(0))), P(s(0)))
We considered the (Usable) Rules:

p(s(0)) → 0
And the Tuples:

F(s(0)) → c1(F(p(s(0))), P(s(0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [4]   
POL(F(x1)) = [4]x1   
POL(P(x1)) = [4] + x1   
POL(c1(x1, x2)) = x1 + x2   
POL(p(x1)) = [4]   
POL(s(x1)) = [5] + x1   

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(0) → cons(0, n__f(s(0)))
f(s(0)) → f(p(s(0)))
f(z0) → n__f(z0)
p(s(0)) → 0
activate(n__f(z0)) → f(z0)
activate(z0) → z0
Tuples:

F(s(0)) → c1(F(p(s(0))), P(s(0)))
S tuples:none
K tuples:

F(s(0)) → c1(F(p(s(0))), P(s(0)))
Defined Rule Symbols:

f, p, activate

Defined Pair Symbols:

F

Compound Symbols:

c1

(7) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(8) BOUNDS(O(1), O(1))